Parity-Check Matrix Extension to Lower the Error Floors of Irregular LDPC Codes
نویسندگان
چکیده
Trapping sets have been identified as one of the main factors causing error floors of low-density parity-check (LDPC) codes at high SNR values. By adding several new rows to the original parity-check matrix, a novel method is proposed to eliminate small trapping sets in the LDPC code’s Tanner graph. Based on this parity-check matrix extension, we design new codes with low error floors from the original irregular LDPC codes. Simulation results show that the proposed method can lower the error floors of irregular LDPC codes significantly at high SNR values over AWGN channels. key words: error floor, low-density parity-check (LDPC) codes, trapping sets
منابع مشابه
Construction of irregular LDPC codes with low error floors
This work explains the relationship between cycles, stopping sets, and dependent columns of the parity check matrix of low-density parity-check (LDPC) codes. Furthermore, it discusses how these structures limit LDPC code performance under belief propagation decoding. A new metric called extrinsic message degree (EMD) measures cycle connectivity in bipartite graphs. Using an easily computed esti...
متن کاملAn Efficient Heuristic Approach for Irregular LDPC Code Construction with Low Error
Low-Density Parity-Check (LDPC) codes are increasingly being considered as good candidates for the nextgeneration FEC codes in high throughput wireless and recording applications. Trapping sets (TSs) are known to cause error floors in regular and irregular low-density parity-check (LDPC) codes. In existing algorithm, namely the Progressive-Edge-Growth Approximate-minimum-Cycle-Set-Extrinsic-mes...
متن کاملConstruction of Irregular LDPC Code Using ACE Algorithm
The Low Density Parity Check (LDPC) codes have been widely acclaimed in recent years for their nearcapacity performance, they have not found their way into many important applications. For some cases, this is due to their increased decoding complexity relative to the classical coding techniques. For other cases, this is due to their inability to reach very low bit error rates at low signal-to-n...
متن کاملLowering Error Floors by Concatenation of Low-Density Parity-Check and Array Code
Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to ...
متن کاملAnalysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group GL(m, F2) and the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 94-B شماره
صفحات -
تاریخ انتشار 2011